Extension problems with degree bounds
نویسندگان
چکیده
We have proved in an earlier paper that the complexity of the list homomorphism problem, to a fixed graph H , does not change when the input graphs are restricted to have bounded degrees (except in the trivial case when the bound is two). By way of contrast, we show in this paper that the extension problem, again to a fixed graph H , can, in some cases, become easier for graphs with bounded degrees.
منابع مشابه
Pole Placement and Matrix Extension Problems : a Common
This paper studies a general inverse eigenvalue problem which generalizes many well-studied pole placement and matrix extension problems. It is shown that the problem corresponds geometrically to a so-called central projection from some projective variety. The degree of this variety represents the number of solutions the inverse problem has in the critical dimension. We are able to compute this...
متن کاملImplicit Degree of Support for Finite Lower-Upper Conditional Probabilities Extensions
In this paper we propose a measure for the implicit degree of support for coherent extensions of probabilistic models based on partial conditional lower-upper assessments. This degree of support is induced by the different extension bounds that arise operationally in automated computational inference procedures. These different bounds are induced by the “extreme” distributions compatible with a...
متن کاملPole Placement and Matrix Extension Problems: A Common Point of View
The paper studies a general inverse eigenvalue problem which generalizes many well studied pole placement and matrix extension problems. It is shown that the problem corresponds geometrically to a so-called central projection from some projective variety. The degree of this variety represents the number of solutions the inverse problem has in the critical dimension. We are able to compute this ...
متن کاملTime-Space Tradeoffs for Learning from Small Test Spaces: Learning Low Degree Polynomial Functions
We develop an extension of recently developed methods for obtaining time-space tradeoff lower bounds for problems of learning from random test samples to handle the situation where the space of tests is signficantly smaller than the space of inputs, a class of learning problems that is not handled by prior work. This extension is based on a measure of how matrices amplify the 2-norms of probabi...
متن کاملDetermining the Optimal Value Bounds of the Objective Function in Interval Quadratic Programming Problem with Unrestricted Variables in Sign
In the most real-world applications, the parameters of the problem are not well understood. This is caused the problem data to be uncertain and indicated with intervals. Interval mathematical models include interval linear programming and interval nonlinear programming problems.A model of interval nonlinear programming problems for decision making based on uncertainty is interval quadratic prog...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 157 شماره
صفحات -
تاریخ انتشار 2009